Fast Convergence Layout Algorithm for Drawing Graphs in Marching-Graph
نویسندگان
چکیده
منابع مشابه
A graph layout algorithm for drawing metabolic pathways
MOTIVATION A large amount of data on metabolic pathways is available in databases. The ability to visualise the complex data dynamically would be useful for building more powerful research tools to access the databases. Metabolic pathways are typically modelled as graphs in which nodes represent chemical compounds, and edges represent chemical reactions between compounds. Thus, the problem of v...
متن کاملA Fast Multi-Dimensional Algorithm for Drawing Large Graphs
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Projecting high-dimensional drawings onto two or three dimensions often resul...
متن کاملA Fast Adaptive Layout Algorithm for Undirected Graphs
We present a randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the spring-embedder paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscillations. The proposed algorithm achieves drawings of high quality on a wide range of graphs with standard set...
متن کاملA New Constraint-Based Compound Graph Layout Algorithm for Drawing Biochemical Networks
Due to the huge amount of information available in biochemical databases, biologists need sophisticated tools to accurately extract the information from such databases and to interpret it correctly. Those tools must be able to dynamically generate any kind of biochemical subgraph (i.e., metabolic pathways, genetic regulation, signal transduction, etc.) in a single graph. The visualization tools...
متن کاملA Meta Heuristic for Graph Drawing Learning the Optimal Graph-Drawing Method for Clustered Graphs
The problem of finding a pleasant layout for a given graph is a key challenge in the field of information visualization. For graphs that are biased towards a particular property such as tree-like, star-like, or bipartite, a layout algorithm can produce excellent layouts—if this property is actually detected. Typically, a graph may not be of such a homogeneous shape but is comprised of different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2008
ISSN: 1000-9825
DOI: 10.3724/sp.j.1001.2008.01920